Scheduling a forge with due dates and die deterioration
نویسندگان
چکیده
منابع مشابه
Scheduling Trains and Containers with Due Dates and Dynamic Arrivals
We consider the problem of scheduling trains and containers (or trucks and pallets) between a depot and a destination. Goods arrive at the depot dynamically over time and have distinct due dates at the destination. There is a fixed-charge transportation cost for each vehicle, and each vehicle has the same capacity. The cost of holding goods may differ between the depot and the destination. The ...
متن کاملPreemptive Scheduling with Variable Profile, Precedence Constraints and Due Dates
This paper is concerned with the problem of scheduling preemptive tasks subject to precedence constraints in order to minimize the maximum lateness and the makespan. The number of available parallel processors is allowed to vary in time. It is shown that when an Earliest Due Date rst algorithm provides an optimal nonpreemptive schedule for unit-execution-time (UET) tasks, then the preemptive pr...
متن کاملSingle Machine Scheduling with Distinct Due Dates under Fuzzy Environment
Single machine, distinct due dates, early/lately machine problem and fuzzy environment closely models the situation faced by ‘Just In Time’ manufacturing. The objective of this paper is to sequence the jobs on the machine, so that the total penalty cost be minimum. This cost is composed of the total earliness and the total tardiness cost. An algorithm is developed here to minimize the total pen...
متن کاملSingle-machine scheduling with release dates, due dates and family setup times
We address the NP-hard problem of scheduling n independent jobs with release dates, due dates, and family setup times on a single machine to minimize the maximum lateness. This problem arises from the constant tug-of-war going on in manufacturing between efficient production and delivery performance, between maximizing machine utilization by batching similar jobs and maximizing customers’ satis...
متن کاملDynamic scheduling of multiproduct pipelines with multiple delivery due dates
Scheduling product batches in pipelines is a very complex task with many constraints to be considered. Several papers have been published on the ubject during the last decade. Most of them are based on large-size MILP discrete time scheduling models whose computational efficiency greatly iminishes for rather long time horizons. Recently, an MILP continuous problem representation in both time an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2019
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-019-03336-6